SXSAQCT and XSAQCT: XML Queryable Compressors
نویسندگان
چکیده
Recently, there has been a growing interest in queryable XML compressors, which can be used to query compressed data with minimal decompression, or even without any decompression. At the same time, there are very few such projects, which have been made available for testing and comparisons. In this paper, we report our current work on two novel queryable XML compressors; a schema‐based compressor, SXSAQCT, and a schema‐free compressor, XSAQCT. While the work on both compressors is in its early stage, our experiments (reported here) show that our approach may be successfully competing with other known queryable compressors.
منابع مشابه
Annotated Trees and their Applications to XML Compression
Permutation based XML-conscious compressors permute the input document to improve the compression ratio and support efficiency of operations, such as queries or updates. One such compressor, XSAQCT, uses the properties of the permuted document, called an annotated tree, to these operations. This paper provides the formal background for the definition of an of D. It also provides an algorithm fo...
متن کاملQRFXFreeze: Queryable Compressor for RFX
The verbose nature of XML has been mulled over again and again and many compression techniques for XML data have been excogitated over the years. Some of the techniques incorporate support for querying the XML database in its compressed format while others have to be decompressed before they can be queried. XML compression in which querying is directly supported instantaneously with no compromi...
متن کاملUpdates of Compressed Dynamic XML Documents
Because of the ever-growing number of applications that send numerous and potentially large XML files over networks there has been a recent interest in efficient updates of XML documents. However all known approaches deal with uncompressed documents. In this paper, we describe a novel XML compressor, XSAQCT designed to improve the efficiency of querying and updating XML documents with minimal d...
متن کاملIDB: Unified Query Interface for Information on the Web
XML [4] is likely to become the primary vehicle of the information interchange on the Web. Organizations will publish and export their data in XML to facilitate interand intra-organization information sharing. Businesses will publish their product information in XML for their customers or for software agents for on-line shopping services. This is already beginning to happen: a number of ontolog...
متن کاملXML tree structure compression using RePair
XML tree structures can conveniently be represented using ordered unranked trees. Due to the repetitiveness of XML markup these trees can be compressed effectively using dictionary-based methods, such as minimal directed acyclic graphs (DAGs) or straight-line context-free (SLCF) tree grammars. While minimal SLCF tree grammars are in general smaller than minimal DAGs, they cannot be computed in ...
متن کامل